منابع مشابه
Blending Different Latency Traffic with Alpha-mixing
Currently fielded anonymous communication systems either introduce too much delay and thus have few users and little security, or have many users but too little delay to provide protection against large attackers. By combining the user bases into the same network, and ensuring that all traffic is mixed together, we hope to lower delay and improve anonymity for both sets of users. Alpha-mixing i...
متن کاملMixing and Un-mixing by Incompressible Flows
We consider the questions of efficient mixing and un-mixing by incompressible flows which satisfy periodic, no-flow, or no-slip boundary conditions on a square. Under the uniform-in-time constraint ‖∇u(·, t)‖p ≤ 1 we show that any function can be mixed to scale ε in time O(| log ε|1+νp), with νp = 0 for p < 3+ √ 5 2 and νp ≤ 13 for p ≥ 3+ √ 5 2 . Known lower bounds show that this rate is optima...
متن کاملConservative mixing, competitive mixing and their applications
In many of the models applied to simulations of turbulent transport and turbulent combustion, the mixing between particles is used to reflect the influence of the continuous diffusion terms in the transport equations. Stochastic particles with properties and mixing can be used not only for simulating turbulent combustion, but also for modeling a large spectrum of physical phenomena. Traditional...
متن کاملMixing English in Persian Print Advertising Discourse
This article intended to illustrate a profile of the impact of English in magazine print advertising in Iran, examining the quantitative results obtained from discourse analysis. Three issues of Khanevadeh Sabz and two issues of Zendegi Ideal, female-oriented and best-seller magazines published in 2011, were collected and a total of 261 advertisements was analyzed qualitatively. Results showed ...
متن کاملMixing
In this tutorial, we introduce the notion of a Markov chain and explore how it can be used to sample from a large set of configurations. Our primary focus is determining how quickly a Markov chain “mixes,” or converges to its stationary distribution, as this is the key factor in the running time. We provide an overview of several techniques used to establish good bounds on the mixing time. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 1974
ISSN: 0019-2082
DOI: 10.1215/ijm/1256051355